Data structures - PDFSEARCH.IO - Document Search Engine

Data structures
Results: 1048

#	Item
901	6.851: Advanced Data Structures Spring 2012 Lecture 2 — 02/09, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Abstract data types Computer programming Priority queue Data structures Bin Persistent data structure Rope Fractional cascading Segment tree Graph theory Binary trees Computing
902	Retroactive Data Structures ERIK D. DEMAINE Massachusetts Institute of Technology and JOHN IACONO Polytechnic University Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2007-05-21 16:15:43 Database management systems Abstract data types Software engineering Dynamization Disjoint-set data structure Persistent data structure Database Priority queue SQL Data structures Computing Data management
903	Automatic Atomicity Verification for Clients of Concurrent Data Structures Mohsen Lesani, Todd Millstein, and Jens Palsberg University of California, Los Angeles {lesani, todd, palsberg}@cs.ucla.edu Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2014-05-14 20:27:08 Concurrency control Transaction processing Concurrent computing Databases Linearizability Atomicity Concurrent data structure Mereology Serializability Computing Computer programming Data management
904	6.851: Advanced Data Structures Spring 2012 Lecture 11 — March 22, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-17 11:31:50 Graph theory Computing Search algorithms Van Emde Boas tree Binary search tree Binary search algorithm Time complexity Pointer machine Search tree Theoretical computer science Binary trees Data structures
905	6.851: Advanced Data Structures Spring 2012 Lecture 13 — April 5, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Communication Computational complexity theory Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation Information theory Communication complexity Combinatory logic Theoretical computer science Applied mathematics Mathematics
906	6.851: Advanced Data Structures Spring 2012 Lecture 18 — April 26, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-04-30 01:03:01 Arrays Data structures Suffix tree Compressed suffix array Suffix array Bit array String Trie Succinct data structure Computing Theoretical computer science Computer programming
907	CURRICULUM VITAE S¸erban A. Basarab A) General data. I am graduate of the Faculty of Electronics of the Technical University of Bucharest in 1961 and of the Faculty of Mathematics of the University of Bucharest in 1969. Add to Reading List Source URL: www.imar.ro Language: English - Date: 2011-02-09 13:41:23 Galois theory Algebraic structures P-adically closed field Absolute Galois group Profinite group Field Henselian ring Finite field Group theory Abstract algebra Algebra Field theory
908	6.851: Advanced Data Structures Spring 2012 Lecture 4 — February 28, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:43 Fibonacci heap Fractional cascading Golden ratio FO Sheaf Mathematics Theoretical computer science Numbers
909	6.851: Advanced Data Structures Spring 2012 Lecture L16 — April 19, 2012 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2012-05-29 13:10:42 Binary trees Sorting algorithms Suffix tree Data structures Trie Suffix array Radix sort Search tree Binary search tree Computing Graph theory Computer programming
910	Confluently Persistent Tries for Efficient Version Control∗ Erik D. Demaine†‡ Stefan Langerman§ Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2009-05-21 11:29:36 Computing Computer programming Binary search tree Trie Rope Tree T-tree Search tree B-tree Binary trees Graph theory Data structures

UPDATE